Solving makespan minimization problems with Lagrangean decomposition
نویسندگان
چکیده
منابع مشابه
Decomposition-based Makespan Minimization in Job Shops
This paper proposes a decomposition-based heuristic approach to minimizing the makespan of job shops. In general, decomposition methods first divide the whole problem into several sub-problems, solve them and then combine sub-schedules to obtain a good feasible schedule. Although it may be reasonable to minimize the makespan of each sub-problem, its optimality will be lost when combining sub-sc...
متن کاملBenders Decomposition for Mixed- Integer Hydrothermal Problems by Lagrangean Relaxation
Decomposition models with integer variables usually decompose into a master problem that comprises all the integer variables and subproblems, which evaluate the remaining variables. Subproblems with integer variables introduce additional difficulties and require the use of nonlinear duality theory. In this paper we address the solution of a mixed integer hydrothermal coordination problem combin...
متن کاملA Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems
Industrial & Engineering Chemistry Research is published by the American Chemical Society. 1155 Sixteenth Street N.W., Washington, DC 20036 Article A Hierarchical Lagrangean Relaxation Procedure for Solving Midterm Planning Problems Anshuman Gupta, and Costas D. Maranas Ind. Eng. Chem. Res., 1999, 38 (5), 1937-1947• DOI: 10.1021/ie980782t • Publication Date (Web): 26 March 1999 Downloaded from ...
متن کاملMakespan Minimization with Machine Availability Constraints
We investigate the problems of scheduling n jobs tom = m1+ m2 identical machines where m1 machines are always available, m2 machines have some specified unavailable intervals.The objective is tominimize the makespan. We assume that if a job is interrupted by the unavailable interval, it can be resumed after the machine becomes available. We show that if at least one machine is always available,...
متن کاملSolving railway line planning problems using a decomposition algorithm
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90176-o